vacant queue - перевод на Английский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

vacant queue - перевод на Английский

ABSTRACT DATA TYPE
Bounded queue; Queue (data structure); Real-time queue; Amortized queue

vacant queue      
см. empty queue
queuing         
  • 1940s poster promoting safety procedures during civil defense air raid drills.
  • People lined up when boarding a suburban bus in Prague.
  • Commuters at [[Osaka Station]] waiting to board a train. Queues for specific trains are marked by color-coded lines on the platform.
  • Waiting number ticket from the main post office of Prague 5 district, Czech Republic. The tickets contains a specification "Letter services – mass submits" and counters No. 8 and 9 which can deal with such a requirement.
  • Waiting queue call system in the Prague main post office. People have number tickets from the machine and are waiting until their number with a number of the counter appears at the red displays.
  • 1943 [[soup kitchen]] queue in [[Aarhus]], Denmark
LINE OF PEOPLE WAITING FOR GOODS OR SERVICES ON A FIRST-COME, FIRST-SERVED BASIS, OR AN AREA WHERE SUCH A LINE FORMS
Queue areas; Queueing; Waiting area; Queuing; Waiting in line; Wait in line; Standing in line; Waitlist management; Queue line
постановка в очередь, формирование очереди. Например, процедура, посредством которой вызовы, направляемые с MS или поступающие на MS, поддерживаются в состоянии ожидания в связи с перегрузкой радиотракта или занятостью вызываемой стороны.
waiting area         
  • 1940s poster promoting safety procedures during civil defense air raid drills.
  • People lined up when boarding a suburban bus in Prague.
  • Commuters at [[Osaka Station]] waiting to board a train. Queues for specific trains are marked by color-coded lines on the platform.
  • Waiting number ticket from the main post office of Prague 5 district, Czech Republic. The tickets contains a specification "Letter services – mass submits" and counters No. 8 and 9 which can deal with such a requirement.
  • Waiting queue call system in the Prague main post office. People have number tickets from the machine and are waiting until their number with a number of the counter appears at the red displays.
  • 1943 [[soup kitchen]] queue in [[Aarhus]], Denmark
LINE OF PEOPLE WAITING FOR GOODS OR SERVICES ON A FIRST-COME, FIRST-SERVED BASIS, OR AN AREA WHERE SUCH A LINE FORMS
Queue areas; Queueing; Waiting area; Queuing; Waiting in line; Wait in line; Standing in line; Waitlist management; Queue line
[воен.] выжидательный район (при форсировании водной преграды)

Википедия

Queue (abstract data type)

In computer science, a queue is a collection of entities that are maintained in a sequence and can be modified by the addition of entities at one end of the sequence and the removal of entities from the other end of the sequence. By convention, the end of the sequence at which elements are added is called the back, tail, or rear of the queue, and the end at which elements are removed is called the head or front of the queue, analogously to the words used when people line up to wait for goods or services.

The operation of adding an element to the rear of the queue is known as enqueue, and the operation of removing an element from the front is known as dequeue. Other operations may also be allowed, often including a peek or front operation that returns the value of the next element to be dequeued without dequeuing it.

The operations of a queue make it a first-in-first-out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed. This is equivalent to the requirement that once a new element is added, all elements that were added before have to be removed before the new element can be removed. A queue is an example of a linear data structure, or more abstractly a sequential collection. Queues are common in computer programs, where they are implemented as data structures coupled with access routines, as an abstract data structure or in object-oriented languages as classes. Common implementations are circular buffers and linked lists.

Queues provide services in computer science, transport, and operations research where various entities such as data, objects, persons, or events are stored and held to be processed later. In these contexts, the queue performs the function of a buffer. Another usage of queues is in the implementation of breadth-first search.

Как переводится vacant queue на Русский язык